An Equational Relation for Ambient Calculus

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Equational Calculus for Alloy

In this paper we show that, by translating Alloy formulas to formulas in the language of fork algebras, we obtain a complete, equational, and purely relational calculus for Alloy.

متن کامل

An equational deductive system for the differential and integral calculus

This article presents an outline of a system of equational deductions in the calculus that can be the basis of a computer program. We intend that our system be as faithful as possible to the usual (Leibniz) calculus notation and inferences. The language, however, is restricted mainly to equations, so the system is not sufficient to provide a basis for proving theorems, but we think it is suffic...

متن کامل

Equational Prgoramming in lambda-calculus

A system of equations in the Acalculus is a pair (r, X) where I' is a set of formulas of A (the equations) and X is a finite set of variables of A (the unknowns). A system S = (r, X) is said to be solvable in the theory T (p'-solvable) iff there exists a simultaneous substitution with closed X-tem for the unknowns that makes the formulas of r theorems in the theory T. We define a class of syste...

متن کامل

Sequent Calculus and Equational Programming

Proof assistants and programming languages based on type theories usually come in two flavours: one is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in equational style. We show here that the equational approach corresponds to the use of a focused presentation of a type theory expressed as a sequent calculus. A ty...

متن کامل

An Expanded Ambient Calculus with Π-calculus Embedding

Formal methods is the branch of computer science most concerned with the mathematical formalization of computational frameworks and the specification of programs and programming languages. The formulation of computability most familiar to an undergraduate is most likely the Turing machine, which models computation in a way intuitive to the layperson; a Turing machine consists of a malleable tap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IPSJ Digital Courier

سال: 2005

ISSN: 1349-7456

DOI: 10.2197/ipsjdc.1.590